Liveness in Weighted Routed Nets
نویسنده
چکیده
In this paper, we present an algorithm to check liveness of weighted routed nets. This novel method is based on the total number of event equations for each single input subnet and on a continuous approximation of a Petri net that provides linear equation descriptions. Vivacitt des rrseaux ponddrrs routage RRsumm : Dans cet article, nous prrsentons un algorithme pour vriier la vivacitt des rrseaux de Petri ponddrrs avec routage. Cette nouvelle approche s'appuie sur l''quation du nombre total de tirs dans chaque sous-rrseau entrre unique et sur une approximation continue du rrseau de Petri qui permet de manipuler des quations linnaires.
منابع مشابه
Extended Synchronized Choice Nets
Unlike traditional classification by output conditions of places, synchronized choice nets (SNCs) were defined as a new class of nets where all first-order structures (FOSs) are symmetric. SNCs are extended to deal with nets with asymmetric first-order structures (AFOSs). A subclass called extended SNCs (ESNCs) can be converted to a general Petri net, called a weighted SNC (WSNC). A WSNC is an ...
متن کاملOn Compositionality of Boundedness and Liveness for Nested Petri Nets
Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...
متن کاملA Structure Causality Relation for Liveness Characterisation in Petri Nets
Characterising liveness using a structure based approach is a key issue in theory of Petri nets. In this paper, we introduce a structure causality relation from which a topological characterisation of liveness in Petri nets is defined. This characterisation relies on a controllability property of siphons and allows to determine the borders of the largest abstract class of Petri nets for which e...
متن کاملObservable Liveness
Abstract. Whereas the traditional liveness property for Petri nets guarantees that each transition can always occur again, observable liveness requires that, from any reachable marking, each observable transition can be forced to fire by choosing appropriate controllable transitions; hence it is defined for Petri nets with distinguished observable and controllable transitions. We introduce obse...
متن کاملComplexity Results for 1-safe Nets
We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996